A fast algorithm for matching remote scene images
نویسندگان
چکیده
منابع مشابه
Fast Deformable Template Matching for Character Recognition in Scene Images
To recognize characters in scene images, a character segmentation method is generally required for pre-processing. However, there are problems that traditional methods are not able to segment “isolated character” which does not constitute a character string and “touching character” which is connected to other characters. Moreover, it is known that character images in scene images suffer from pe...
متن کاملCharacter Recognition in Scene Images by Fast Deformable Template Matching
To recognize characters in scene images, a character segmentation method is generally required for pre-processing. However, there are problems that traditional methods are not able to segment “isolated character” which does not constitute a character string and “touching character” which is connected to other characters. Moreover, it is known that character images in scene images suffer from pe...
متن کاملColor scene transform between images using Rosenfeld-Kak histogram matching method
In digital color imaging, it is of interest to transform the color scene of an image to the other. Some attempts have been done in this case using, for example, lαβ color space, principal component analysis and recently histogram rescaling method. In this research, a novel method is proposed based on the Resenfeld and Kak histogram matching algorithm. It is suggested that to transform the color...
متن کاملA Fast and Robust Scene Matching Method for Navigation
The selection of matching method is critical to the scene matching navigation system, as it determines the accuracy of navigation. A coarse-to-fine matching method, which combines the area-based and feature-based matching method, is presented to meet the requirements of navigation, including the real-time performance, the sub-pixel accuracy and the robustness. In the coarse matching stage, the ...
متن کاملA Fast Algorithm for Confidently Stable Matching
An efficient O(d2n) algorithm for confidently stable matching for general inhibition zones and an O(dn log n) algorithm for X-zones are proposed and proved, where n is matching table size and d is inhibition zone depth.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geo-spatial Information Science
سال: 2008
ISSN: 1009-5020,1993-5153
DOI: 10.1007/s11806-008-0077-9